P, NP and Mathematics – a computational complexity perspective

The P versus NP question distinguished itself as the central question of Theoretical Computer Science nearly four decades ago. The quest to resolve it, and more generally, to understand the power and limits of efficient computation, has led to the development of Computational Complexity Theory. While this mathematical discipline in general, and the P vs. NP problem in particular, have gained prominence within the mathematics community in the past decade, it is still largely viewed as a problem of Computer Science. In this paper I’ll try to explain why this problem, and others in computational complexity, are not only mathematical problems but also problems about mathematics, faced by the working mathematician. I will describe the underlying concepts and problems, the attempts to understand and solve them, and some of the research directions this led us to. I will explain some of the important results, as well as the major goals and conjectures which still elude us. All this will hopefully give a taste of the motivations, richness and interconnectedness of our field. I will conclude with a few non computational problems, which capture P vs. NP and related computational complexity problems, hopefully inviting more mathematicians to attack them as well. I believe it important to give many examples, and to underlie the intuition (and sometimes, philosophy) behind definitions and results. This may slow the pace of this article for some, in the hope to make it clearer to others. Mathematics Subject Classification (2000). Primary 68Q15; Secondary 68Q17.